RETURN-MAP CRYPTANALYSIS REVISITED
نویسندگان
چکیده
منابع مشابه
Return-Map Cryptanalysis Revisited
As a powerful cryptanalysis tool, the method of return-map attacks can be used to extract secret messages masked by chaos in secure communication schemes. Recently, a simple defensive mechanism was presented to enhance the security of chaotic parameter modulation schemes against return-map attacks. Two techniques are combined in the proposed defensive mechanism: multistep parameter modulation a...
متن کاملCryptanalysis of GGH Map
Multilinear map is a novel primitive which has many cryptographic applications, and GGH map is a major candidate of K-linear maps for K > 2. GGH map has two classes of applications, which are respectively applications with public tools of encoding and with hidden tools of encoding. In this paper we show that applications of GGH map with public tools of encoding are not secure, and that one appl...
متن کاملRotational Cryptanalysis of ARX Revisited
Rotational cryptanalysis is a probabilistic attack applicable to word oriented designs that use (almost) rotation-invariant constants. It is believed that the success probability of rotational cryptanalysis against ciphers and functions based on modular additions, rotations and XORs, can be computed only by counting the number of additions. We show that this simple formula is incorrect due to t...
متن کاملAlgebraic Techniques in Differential Cryptanalysis Revisited
At FSE 2009, Albrecht et al. proposed a new cryptanalytic method that combines algebraic and differential cryptanalysis. They introduced three new attacks, namely Attack A, Attack B and Attack C. For Attack A, they explain that the time complexity is difficult to determine. The goal of Attacks B and C is to filter out wrong pairs and then recover the key. In this paper, we show that Attack C do...
متن کاملLinear Cryptanalysis Using Multiple Approximations-Revisited
We present a technique which uses multiple linear approximations in the linear cryptanalysis of a block cipher and allows for a reduction in the amount of data required for a successful attack. Although the method using many linear approximations was already suggested by B. Kaliski and M. Robshaw in 1994, this paper describes an revisited version utilizing a lot of approximations. In this paper...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Bifurcation and Chaos
سال: 2006
ISSN: 0218-1274,1793-6551
DOI: 10.1142/s0218127406015507